Approximate Inference in Graphical Models using Tensor Decompositions

نویسنده

  • Marcel van Gerven
چکیده

We demonstrate that tensor decompositions can be used to transform graphical models into structurally simpler graphical models that approximate the same joint probability distribution. In this way, standard inference algorithms such as the junction tree algorithm, can be used in order to use the transformed graphical model for approximate inference. The usefulness of the technique is demonstrated by means of its application to thirty randomly generated small-world Markov networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tensor Belief Propagation

We propose a new approximate inference algorithm for graphical models, tensor belief propagation, based on approximating the messages passed in the junction tree algorithm. Our algorithm represents the potential functions of the graphical model and all messages on the junction tree compactly as mixtures of rank-1 tensors. Using this representation, we show how to perform the operations required...

متن کامل

An Approximate Tensor-Based Inference Method Applied to the Game of Minesweeper

We propose an approximate probabilistic inference method based on the CP-tensor decomposition and apply it to the well known computer game of Minesweeper. In the method we view conditional probability tables of the exactly -out-of-k functions as tensors and approximate them by a sum of rank-one tensors. The number of the summands is min{l + 1, k − l + 1}, which is lower than their exact symmetr...

متن کامل

Tensor Networks for Big Data Analytics and Large-Scale Optimization Problems

Tensor decompositions and tensor networks are emerging and promising tools for data analysis and data mining. In this paper we review basic and emerging models and associated algorithms for large-scale tensor networks, especially Tensor Train (TT) decompositions using novel mathematical and graphical representations. We discus the concept of tensorization (i.e., creating very high-order tensors...

متن کامل

Approximate Inference in Graphical Models

OF THE DISSERTATION Approximate Inference in Graphical Models By Sholeh Forouzan Doctor of Philosophy in Computer Science University of California, Irvine, 2015 Professor Alexander Ihler, Chair Graphical models have become a central paradigm for knowledge representation and reasoning over models with large numbers of variables. Any useful application of these models involves inference, or reaso...

متن کامل

Approximate Inference in Collective Graphical Models

We study the problem of approximate inference in collective graphical models (CGMs), which were recently introduced to model the problem of learning and inference with noisy aggregate observations. We first analyze the complexity of inference in CGMs: unlike inference in conventional graphical models, exact inference in CGMs is NP-hard even for tree-structured models. We then develop a tractabl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007